A model for waiting times for non-stationary queueing systems
نویسندگان
چکیده
منابع مشابه
A Mathematical Model for Scheduling Elective Surgeries for Minimizing the Waiting Times in Emergency Surgeries
The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولFirst in Line Waiting Times as a Tool for Analysing Queueing Systems
We introduce a new approach to modelling queueing systems where the priority or the routing of customers depends on the time the first customer has waited in the queue. This past waiting time of the first customer in line, W, is used as the primary variable for our approach. A Markov chain is used for modelling the system where the states represent both the number of free servers and a discrete...
متن کاملAsymptotic Recurrence and Waiting times for Stationary Processes
Let X = fX n ; n 2 Zg be a discrete-valued stationary ergodic process distributed according to P and let x = of the recurrence time R n deened as the rst time that the initial n-block x n 1 = (x 1 ; x 2 ; : : : ; x n) reappears in the past of x. We identify an associated random walk, ? log P (X n 1); on the same probability space as X, and we prove a strong approximation theorem between log R n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Management and Science
سال: 2016
ISSN: 2250-1819,2249-1260
DOI: 10.26524/jms.2016.8